Semidefinite Relaxation Algorithm for Multisource Localization Using TDOA Measurements with Range Constraints
نویسندگان
چکیده
منابع مشابه
Semidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولTDoA based UAV Localization using Dual-EKF Algorithm
Most UAV(unmaned aerial vehicle) systems use GPS signals only to locate the emitter’s position. However GPS signals contain unwanted information contaminated by environmental components and many interference signals. In this paper, to obtain TDoA signal, we use two UAVs which are equipped with embedded wireless sensors. Under the real geolocation circumstance, it is very difficult to estimate t...
متن کاملEdge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
The sensor network localization problem has been much studied. Based on the edge-based semidefinite programming relaxation (ESDP) recently proposed by Wang, Zheng, Boyd, and Ye [28], we consider strengthening the relaxation by adding lower bound constraints. We study some key properties of lower-bound-constrained ESDP relaxation (ESDPlb), showing that, when distances are exact, zero individual ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wireless Communications and Mobile Computing
سال: 2018
ISSN: 1530-8669,1530-8677
DOI: 10.1155/2018/9430180